Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
نویسندگان
چکیده
Settling a ten years open question, we show that the NPcomplete Feedback Vertex Set problem is deterministically solvable in O(c ·m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NPcomplete Edge Bipartization problem with runtime O(2 ·m).
منابع مشابه
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments is amenable to the novel iterative compression technique. Moreover, we provide data reductions and problem kernels fo...
متن کاملDynamic Parameterized Problems and Algorithms
Fixed-parameter algorithms and kernelization are two powerful methods to solve NP-hard problems. Yet, so far those algorithms have been largely restricted to static inputs. In this paper we provide fixed-parameter algorithms and kernelizations for fundamental NPhard problems with dynamic inputs. We consider a variety of parameterized graph and hitting set problems which are known to have f(k)n ...
متن کاملParameterized algorithms for feedback set problems and their duals in tournaments
The parameterized feedback vertex (arc) set problem is to find whether there are k vertices (arcs) in a given graph whose removal makes the graph acyclic. The parameterized complexity of this problem in general directed graphs is a long standing open problem. We investigate the problems on tournaments, a well studied class of directed graphs. We consider both weighted and unweighted versions. W...
متن کاملImproved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG
We give improved parameterized algorithms for two “edge” problems MAXCUT and MAXDAG, where the solution sought is a subset of edges. MAXCUT of a graph is a maximum set of edges forming a bipartite subgraph of the given graph. On the other hand, MAXDAG of a directed graph is a set of arcs of maximum size such that the graph induced on these arcs is acyclic. Our algorithms are obtained through ne...
متن کاملExperimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
Feedback Vertex Set is a classic combinatorial optimization problem that asks for a minimum set of vertices in a given graph whose deletion makes the graph acyclic. From the point of view of parameterized algorithms and fixed-parameter tractability, Feedback Vertex Set is one of the landmark problems: a long line of study resulted in multiple algorithmic approaches and deep understanding of the...
متن کامل